Fibonacci numbers and Fermat ’ s last theorem

نویسندگان

  • Zhi-Hong Sun
  • Zhi-Wei Sun
چکیده

numbers. As applications we obtain a new formula for the Fibonacci quotient Fp−( 5 p )/p and a criterion for the relation p |F(p−1)/4 (if p ≡ 1 (mod 4)), where p 6= 5 is an odd prime. We also prove that the affirmative answer to Wall’s question implies the first case of FLT (Fermat’s last theorem); from this it follows that the first case of FLT holds for those exponents which are (odd) Fibonacci primes or Lucas primes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fibonacci Numbers at Most One Away from a Perfect Power

The famous problem of determining all perfect powers in the Fibonacci sequence and the Lucas sequence has recently been resolved by three of the present authors. We sketch the proof of this result, and we apply it to show that the only Fibonacci numbers Fn such that Fn ± 1 is a perfect power are 0, 1, 2, 3, 5 and 8. The proof of the Fibonacci Perfect Powers Theorem involves very deep mathematic...

متن کامل

Cycles in the Generalized Fibonacci Sequence modulo a Prime

Since their invention in the thirteenth century, Fibonacci sequences have intrigued mathematicians. As well as modeling the population patterns of overly energetic rabbits, however, they have sparked developments in more serious mathematics. For example, generalized Fibonacci sequences crop up in all manner of situations, from fiber optic networks [3] to computer algorithms [1] to probability t...

متن کامل

On Fibonacci Polynomial Expressions for Sums of mth Powers, their implications for Faulhaber’s Formula and some Theorems of Fermat

Denote by Σnm the sum of the m-th powers of the first n positive integers 1m + 2m + . . .+ nm. Similarly let Σrnm be the r-fold sum of the m-th powers of the first n positive integers, defined such that Σn = nm, and then recursively by Σn = Σr1m+Σr2m+ . . .+Σrnm. During the early 17th-century, polynomial expressions for the sums Σrnm and their factorisation and polynomial basis representation p...

متن کامل

NEW CONNECTION FORMULAE BETWEEN (p, q)−FIBONACCI POLYNOMIALS AND CERTAIN JACOBI POLYNOMIALS

The main purpose of this article is to solve the connection problems between (p, q)−Fibonacci polynomials and the two polynomials, namely Chebyshev polynomials of third and fourth kinds which are considered as two nonsymmetric polynomials of the Jacobi polynomials. Moreover, the inversion connection formulae for the latter formulae are given. We show that all the connection coefficients are exp...

متن کامل

Classical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers

This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006